Predicting Partial Paths from Planning Problem Parameters
نویسندگان
چکیده
Many robot motion planning problems can be described as a combination of motion through relatively sparsely filled regions of configuration space and motion through tighter passages. Sample-based planners perform very effectively everywhere but in the tight passages. In this paper, we provide a method for parametrically describing workspace arrangements that are difficult for planners, and then learning a function that proposes partial paths through them as a function of the parameters. These suggested partial paths are then used to significantly speed up planning for new problems.
منابع مشابه
Prediction and simulation of motion in pairs of transmembrane alpha-helices
MOTIVATION Motion in transmembrane (TM) proteins plays an essential role in a variety of biological phenomena. Thus, developing an automated method for predicting and simulating motion in this class of proteins should result in an increased level of understanding of crucial physiological mechanisms. We have developed an algorithm for predicting and simulating motion in TM proteins of the alpha-...
متن کاملAn Explicit Characterization of Minimum Wheel-Rotation Paths for Differential-Drives
This paper presents characterization of shortest paths for differentialdrive mobile robots with classifying solutions in the spirit of Dubins curves and Reeds-Shepp curves for car-like robots. Not only optimal paths for mobile robots are interesting with respect to the optimized criteria, but also they offer a family of motion primitives that can be used for motion planning in the presence of o...
متن کاملSpreading paths in partially observed social networks
Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a netwo...
متن کاملSuboptimal Path Planning and Control for AERCamjSprint : Final Report
This paper describes a technique for planning collision-free, fuel-efficient paths and thruster controls for moving Sprint from an initial to a goal location and attitude among multiple obstacles. The planning problem is formulated as a nonlinear optimization problem whose parameters are the locations of control points of splines representing Sprint's path and the time interval between the cont...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کامل